Complexity of inventory routing problems when routing is easy
نویسندگان
چکیده
منابع مشابه
Inventory Routing Problems : a multiobjective approach
Logistic activities, from a certain point of view, are often structured around two concepts, the transportation of goods and the management of the same goods. Of course, these two activities are highly interlinked. It is possible to combine at the same time the problem of defining the amount of goods that have to be shipped (the Inventory Management problem – the quantity decision) and the rout...
متن کاملThe Complexity of Arc Routing Problems
This chapter is devoted to surveying aspects of computational complexity for three central arc routing problems (and their corresponding variants): • Chinese Postman, where one asks for a minimum-cost tour traversing all edges of a graph at least once; • Rural Postman, which generalizes Chinese Postman in the sense that only a subset of the edges has to be visited; • Capacitated Arc Routing, re...
متن کاملComplexity of routing problems with release dates
In this paper we consider a routing problem where uncapacitated vehicles are loaded with goods, requested by the customers, that arrive at the depot over time. The arrival time of a product at the depot is called its release date. We consider two variants of the problem. In the first one a deadline to complete the distribution is given and the total distance traveled is minimized. In the second...
متن کاملRobust Routing Made Easy
Designing routing schemes is a multidimensional and complex task that depends on the objective function, the computational model (centralized vs. distributed), and the amount of uncertainty (online vs. offline). Nevertheless, there are quite a few well-studied general techniques, for a large variety of network problems. In contrast, in our view, practical techniques for designing robust routing...
متن کاملThe exact solution of several classes of inventory-routing problems
In order to be competitive companies need to take advantage of synergetic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be taken simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2019
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21908